#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int N = 2e5 + 10;

int n, a, b;

bool cmp(pii x, pii y) {
    if (x.first == y.first)
        return x.second > y.second;
    return x.first < y.first;
}

int ans[N];

int main() {
    cin >> n;
    vector<pii> v;

    for (int i = 0; i < n; i++) {
        cin >> a >> b;
        v.push_back(make_pair(a, 0));
        v.push_back(make_pair(a + b, 1));
    }

    sort(v.begin(), v.end(), cmp);
    int k = 0, temp = 0;
    int last = 1, lastk = 0;
    for (int i = 0; i < v.size(); i++) {
        lastk = k;
        if (v[i].second == 0) {
            k++;
        }
        else {
            k--;
        }

        if (v[i].first != last) {
            ans[lastk] += v[i].first - last;
        }
        last = v[i].first;
    }
    for (int i = 1; i <= n; i++)
        cout << ans[i] << ' ';
    cout << endl;

    return 0;
}